Physics of Computation and the Quantum Computing Challenge the Spaghetti Problem the Cooking Problem Quantum Coherent Parallel Computation
نویسندگان
چکیده
Introduction New computation devices increasingly depend on particular physical properties rather than on logical organization alone as used to be the case in conventional technologies. The laws of physics impose limits on increases in computing power. Two of these limits are interconnect wires in multicomputers and thermodynamic limits to energy dissipation in all computers. Quantum computing is a new computational technology which promises to eliminate problems of latency and wiring associated with parallel computers and the rapidly approaching ultimate limits to computing power imposed by the fundamental thermodynamics. It opens the prospect for unlimited parallelism and has been shown to work fast for some standard problems like factoring, where all known classical methods use exponentially exploding time. Quantum search algorithms for unstructured databases turn out to be quadratic faster than classical algorithms can ever be. There are tremendous economical and societal interests involved in the ultimate realization of quantum computing. Here we sketch the short history, basic principles, and implications of this emerging area. In The Netherlands CWI has been one of the first to be involved. In nonsequential (parallel or distributed) computation one can hardly ignore the physical aspects of the underlying computer system. Complexity analysis may stand or fall with the account taken of physical reality. Moreover, nonclassical or nonstandard physical realizations of computers may have totally unexpected properties. Nonconventional technologies which may yield novel computation opportunities, include quantum cryptography [1] and quantum coherent computation. Because the latter, if physically realizable, allows breaking most commonly used cryptosystems, quantum cryptography may be the only safe principle for public cryptography, in the sense that its safety rests on the validity of quantum mechanics, rather than on unproven cryptographic assumptions.
منابع مشابه
Teleportation via an Entangled Coherent Channel and Decoherence Effect on This Channel
We study an entangled two-mode coherent state within the framework of2×2-dimensional Hilbert space. We investigate the problem of quantum teleportation ofa superposition coherent state via an entangled coherent channel. By three differentmeasures with the titles ``minimum assured fidelity (MASF)”, ``average teleportationfidelity” and ``optimal fidelity (f)” we study the ...
متن کاملA novel vedic divider based crypto-hardware for nanocomputing paradigm: An extended perspective
Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...
متن کاملA novel vedic divider based crypto-hardware for nanocomputing paradigm: An extended perspective
Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...
متن کاملCoherent Control of Quantum Entropy via Quantum Interference in a Four-Level Atomic System
The time evaluation of quantum entropy in a four-level double- type atomic system is theoretically investigated. Quantum entanglement of the atom and its spontaneous emission fields is then discussed via quantum entropy. It is found that the degree of entanglement can be increased by the quantum interference induced by spontaneous emission. The phase dependence of the atom-field entanglement is...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کامل